RAZBOROV, ALEXANDER : rechercher sur Z-Library

Le plus grand référentiel d'articles scientifiques au monde. 70,000,000+ d'articles gratuitement.

Don't use scam websites

Livres
Articles (75)
Les plus populaires
Liste
- Liste
- Tableau

1

A product theorem in free groups

Razborov, Alexander

Journal:

Annals of Mathematics

Année:

2014

Langue:

english

Fichier:

PDF, 525 KB

english, 2014

2

Pseudorandom generators hard for k-DNF resolution and polynomial calculus resolution

Razborov, Alexander

Journal:

Annals of Mathematics

Année:

2015

Langue:

english

Fichier:

PDF, 785 KB

english, 2015

3

Natural Proofs

Alexander A Razborov, Steven Rudich

Journal:

Journal of Computer and System Sciences

Année:

1997

Langue:

english

Fichier:

PDF, 454 KB

english, 1997

4

ON THE PARAMETERIZATION OF SOLUTIONS FOR EQUATIONS IN FREE GROUPS

RAZBOROV, ALEXANDER A.

Journal:

International Journal of Algebra and Computation

Année:

1993

Langue:

english

Fichier:

PDF, 936 KB

english, 1993

5

Why are there so many loop formulas?

Lifschitz, Vladimir, Razborov, Alexander

Journal:

ACM Transactions on Computational Logic

Année:

2006

Langue:

english

Fichier:

PDF, 89 KB

english, 2006

6

Satisfiability, Branch-Width and Tseitin tautologies

Michael Alekhnovich, Alexander Razborov

Journal:

Computational Complexity

Année:

2011

Langue:

english

Fichier:

PDF, 680 KB

english, 2011

7

Flag Algebras

Alexander A. Razborov

Journal:

Journal of Symbolic Logic

Année:

2007

Langue:

english

Fichier:

PDF, 3.15 MB

english, 2007

8

Non-Three-Colourable Common Graphs Exist

HATAMI, HAMED, HLADKÝ, JAN, KRÁL', DANIEL, NORINE, SERGUEI, RAZBOROV, ALEXANDER

Journal:

Combinatorics Probability & Computing

Année:

2012

Langue:

english

Fichier:

PDF, 257 KB

english, 2012

9

On the Minimal Density of Triangles in Graphs

RAZBOROV, ALEXANDER A.

Journal:

Combinatorics Probability & Computing

Année:

2008

Langue:

english

Fichier:

PDF, 333 KB

english, 2008

10

Asymptotic Structure of Graphs with the Minimum Number of Triangles

PIKHURKO, OLEG, RAZBOROV, ALEXANDER

Journal:

Combinatorics Probability & Computing

Année:

2017

Langue:

english

Fichier:

PDF, 286 KB

english, 2017

11

nω(log n) lower bounds on the size of depth-3 threshold cicuits with AND gates at the bottom

Alexander Razborov, Avi Wigderson

Journal:

Information Processing Letters

Année:

1993

Langue:

english

Fichier:

PDF, 338 KB

english, 1993

12

Preface

Alexander A. Razborov

Journal:

Theoretical Computer Science

Année:

1996

Langue:

english

Fichier:

PDF, 93 KB

english, 1996

13

Resolution lower bounds for the weak functional pigeonhole principle

Alexander A. Razborov

Journal:

Theoretical Computer Science

Année:

2003

Langue:

english

Fichier:

PDF, 243 KB

english, 2003

14

Majority gates vs. general weighted threshold gates

Mikael Goldmann, Johan Håstad, Alexander Razborov

Journal:

Computational Complexity

Année:

1992

Langue:

english

Fichier:

PDF, 1.40 MB

english, 1992

15

Preface

Sergei Artemov, Volker Diekert, Alexander Razborov

Journal:

Theory of Computing Systems

Année:

2010

Langue:

english

Fichier:

PDF, 90 KB

english, 2010

16

Read-Once Branching Programs, Rectangular Proofs of the Pigeonhole Principle and the Transversal Calculus

Alexander Razborov*, Avi Wigderson†, Andrew Yao‡

Journal:

Année:

2002

Langue:

english

Fichier:

PDF, 289 KB

english, 2002

17

Almost Euclidean subspaces of ℓ1NVIA expander codes

Venkatesan Guruswami, James R. Lee, Alexander Razborov

Journal:

Année:

2010

Langue:

english

Fichier:

PDF, 631 KB

english, 2010

18

On the shrinkage exponent for read-once formulae

Johan Håstad, Alexander Razborov, Andrew Yao

Journal:

Theoretical Computer Science

Année:

1995

Langue:

english

Fichier:

PDF, 767 KB

english, 1995

19

Resolution lower bounds for perfect matching principles

Alexander A Razborov

Journal:

Journal of Computer and System Sciences

Année:

2004

Langue:

english

Fichier:

PDF, 353 KB

english, 2004

20

On the Fon-Der-Flaass interpretation of extremal examples for Turán’s (3, 4)-problem

Alexander A. Razborov

Journal:

Proceedings of the Steklov Institute of Mathematics

Année:

2011

Langue:

english

Fichier:

PDF, 1.58 MB

english, 2011

21

Parameterized Bounded-Depth Frege Is not Optimal

Beyersdorff, Olaf, Galesi, Nicola, Lauria, Massimo, Razborov, Alexander A.

Journal:

ACM Transactions on Computation Theory

Année:

2012

Langue:

english

Fichier:

PDF, 142 KB

english, 2012

22

Space Complexity in Propositional Calculus

Alekhnovich, Michael, Ben-Sasson, Eli, Razborov, Alexander A., Wigderson, Avi

Journal:

SIAM Journal on Computing

Année:

2002

Langue:

english

Fichier:

PDF, 311 KB

english, 2002

23

Resolution Is Not Automatizable Unless W[P] Is Tractable

Alekhnovich, Michael, Razborov, Alexander A.

Journal:

SIAM Journal on Computing

Année:

2008

Langue:

english

Fichier:

PDF, 232 KB

english, 2008

24

Pseudorandom Generators in Propositional Proof Complexity

Alekhnovich, Michael, Ben-Sasson, Eli, Razborov, Alexander A., Wigderson, Avi

Journal:

SIAM Journal on Computing

Année:

2004

Langue:

english

Fichier:

PDF, 283 KB

english, 2004

25

The Sign-Rank of AC$^0$

Razborov, Alexander A., Sherstov, Alexander A.

Journal:

SIAM Journal on Computing

Année:

2010

Langue:

english

Fichier:

PDF, 349 KB

english, 2010

26

On 3-Hypergraphs with Forbidden 4-Vertex Configurations

Razborov, Alexander A.

Journal:

SIAM Journal on Discrete Mathematics

Année:

2010

Langue:

english

Fichier:

PDF, 265 KB

english, 2010

27

[Lecture Notes in Computer Science] Computer Science – Theory and Applications Volume 5010 || Computing Longest Common Substrings Via Suffix Arrays

Hirsch, Edward A., Razborov, Alexander A., Semenov, Alexei, Slissenko, Anatol

Année:

2008

Langue:

english

Fichier:

PDF, 423 KB

english, 2008

28

On the number of pentagons in triangle-free graphs

Hatami, Hamed, Hladký, Jan, Králʼ, Daniel, Norine, Serguei, Razborov, Alexander

Journal:

Journal of Combinatorial Theory, Series A

Année:

2013

Langue:

english

Fichier:

PDF, 224 KB

english, 2013

29

[Lecture Notes in Computer Science] Computer Science – Theory and Applications Volume 5010 || A Unified Categorical Approach for Attributed Graph Rewriting

Hirsch, Edward A., Razborov, Alexander A., Semenov, Alexei, Slissenko, Anatol

Année:

2008

Langue:

english

Fichier:

PDF, 446 KB

english, 2008

30

On the Caccetta-Häggkvist Conjecture with Forbidden Subgraphs

Razborov, Alexander A.

Journal:

Journal of Graph Theory

Année:

2013

Langue:

english

Fichier:

PDF, 561 KB

english, 2013

31

[ACM Press the twenty-sixth annual ACM symposium - Montreal, Quebec, Canada (1994.05.23-1994.05.25)] Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 - Natural proofs

Razborov, Alexander A., Rudich, Steven

Année:

1994

Langue:

english

Fichier:

PDF, 1.01 MB

english, 1994

32

[IEEE 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06) - Berkeley, CA, USA (2006.10.21-2006.10.24)] 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06) - An \Omega(n^1/3 ) Lower Bound for Bilinear Group Based Private Information Retrieval

Razborov, Alexander, Yekhanin, Sergey

Année:

2006

Langue:

english

Fichier:

PDF, 174 KB

english, 2006

33

[IEEE 2008 IEEE 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS) - Philadelphia, PA, USA (2008.10.25-2008.10.28)] 2008 49th Annual IEEE Symposium on Foundations of Computer Science - The Sign-Rank of AC^O

Razborov, Alexander A., Sherstov, Alexander A.

Année:

2008

Langue:

english

Fichier:

PDF, 334 KB

english, 2008

34

Minimum Propositional Proof Length Is NP-Hard to Linearly Approximateby Michael Alekhnovich; Sam Buss; Shlomo Moran; Toniann Pitassi

Review by: Alexander Razborov

Journal:

Bulletin of Symbolic Logic

Année:

2002

Langue:

english

Fichier:

PDF, 301 KB

english, 2002

35

Guessing More Secrets via List Decoding

Razborov, Alexander A.

Journal:

Internet Mathematics

Année:

2005

Langue:

english

Fichier:

PDF, 207 KB

english, 2005

36

Sergei Ivanovich Adian (on his eightieth birthday)

Beklemishev, Lev D, Buchstaber, Viktor M, Lysenok, Igor G, Mal'tsev, Arkadii A, Novikov, Sergei P, Razborov, Alexander A, Semenov, Aleksei L

Journal:

Russian Mathematical Surveys

Année:

2011

Langue:

english

Fichier:

PDF, 257 KB

english, 2011

37

Flag algebras

Razborov, Alexander A.

Journal:

Journal of Symbolic Logic

Année:

2007

Langue:

english

Fichier:

PDF, 3.00 MB

english, 2007

38

Proof complexity and feasible arithmetics, DIMACS workshop, April 21–24, 1996, edited by Beame Paul W. and Buss Samuel R., Series in discrete mathematics and theoretical computer science, vol. 39, American Mathematical Society, Providence 1998, xii + 320 pp.

Razborov, Alexander A.

Journal:

Journal of Symbolic Logic

Année:

1999

Langue:

english

Fichier:

PDF, 426 KB

english, 1999

39

A Simple Proof of Bazzi’s Theorem

Razborov, Alexander

Journal:

ACM Transactions on Computation Theory

Année:

2009

Langue:

english

Fichier:

PDF, 60 KB

english, 2009

40

[ACM Press the twenty-ninth annual ACM symposium - El Paso, Texas, United States (1997.05.04-1997.05.06)] Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97 - Read-once branching programs, rectangular proofs of the pigeonhole principle and the transversal calculus

Razborov, Alexander, Wigderson, Avi, Yao, Andrew

Année:

1997

Langue:

english

Fichier:

PDF, 1.42 MB

english, 1997

41

Propositional proof complexity

Razborov, Alexander

Journal:

Journal of the ACM

Année:

2003

Langue:

english

Fichier:

PDF, 25 KB

english, 2003

42

Real Advantage

Razborov, Alexander, Viola, Emanuele

Journal:

ACM Transactions on Computation Theory

Année:

2013

Langue:

english

Fichier:

PDF, 91 KB

english, 2013

43

[IEEE 2014 IEEE 55th Annual Symposium on Foundations of Computer Science (FOCS) - Philadelphia, PA, USA (2014.10.18-2014.10.21)] 2014 IEEE 55th Annual Symposium on Foundations of Computer Science - On the AC0 Complexity of Subgraph Isomorphism

Li, Yuan, Razborov, Alexander, Rossman, Benjamin

Année:

2014

Langue:

english

Fichier:

PDF, 367 KB

english, 2014

44

A New Kind of Tradeoffs in Propositional Proof Complexity

Razborov, Alexander

Journal:

Journal of the ACM

Année:

2016

Langue:

english

Fichier:

PDF, 226 KB

english, 2016

45

On the Density of Transitive Tournaments

Coregliano, Leonardo Nagami, Razborov, Alexander A.

Journal:

Journal of Graph Theory

Année:

2016

Langue:

english

Fichier:

PDF, 146 KB

english, 2016

46

Diameter of Polyhedra: Limits of Abstraction

Eisenbrand, Friedrich, Hähnle, Nicolai, Razborov, Alexander, Rothvoß, Thomas

Journal:

Mathematics of Operations Research

Année:

2010

Langue:

english

Fichier:

PDF, 170 KB

english, 2010

47

On the $AC^0$ Complexity of Subgraph Isomorphism

Li, Yuan, Razborov, Alexander, Rossman, Benjamin

Journal:

SIAM Journal on Computing

Année:

2017

Langue:

english

Fichier:

PDF, 637 KB

english, 2017

48

On the Width of Semialgebraic Proofs and Algorithms

Razborov, Alexander

Journal:

Mathematics of Operations Research

Année:

2017

Langue:

english

Fichier:

PDF, 675 KB

english, 2017

49

Alekhnovich Michael, Buss Sam, Moran Shlomo, and Pitassi Toniann. Minimum propositional proof length is NP-hard to linearly approximate. The journal of symbolic logic, vol. 66 (2001), pp. 171–191.

Razborov, Alexander

Journal:

Bulletin of Symbolic Logic

Année:

2002

Langue:

english

Fichier:

PDF, 75 KB

english, 2002

50

The future of computational complexity theory: part I

Papadimitriou, Christos H., Goldreich, Oded, Wigderson, Avi, Razborov, Alexander A., Sipser, Michael

Journal:

ACM SIGACT News

Année:

1996

Langue:

english

Fichier:

PDF, 505 KB

english, 1996